Polyhedral compactifications, I
نویسندگان
چکیده
Abstract In this work we describe horofunction compactifications of metric spaces and finite-dimensional real vector through asymmetric metrics polyhedral norms by means nonstandard methods, that is, ultrapowers the at hand. The carry structure stratified with strata indexed dual faces unit ball. Explicit neighborhood bases descriptions horofunctions are provided.
منابع مشابه
Novel Type I Compactifications
We argue that there are two distinct classes of type I compactification to four dimensions on any space. These two classes are distinguished in a mysterious way by the presence (or absence) of a discrete 6-form potential. In simple examples, duality suggests that the new class of compactifications have reduced numbers of moduli. We also point out analogous discrete choices in M, F and type II c...
متن کاملThree Generations in Type I Compactifications
Generalizing the recent work on three-family Type I compactifications, we classify perturbative Type I vacua obtained via compactifying on the T 6/Z2 ⊗ Z2 ⊗ Z3 orbifold with all possible Wilson lines. In particular, we concentrate on models with gauge groups containing the Standard Model gauge group SU(3)c ⊗ SU(2)w ⊗ U(1)Y as a subgroup. All of the vacua we obtain contain D5-branes and are non-...
متن کاملEnd compactifications and general compactifications
We use the insights of Robinson’s nonstandard analysis as a powerful tool to extend and simplify the construction of compactifications of regular spaces. In particular, we deal with the Stone-Čech compactification and compactifications formed from topological ends. For the nonstandard extension of a metric space, the monad of a standard point x is the set of all points infinitesimally close to ...
متن کاملPolyhedral studies in Domination Graph Theory (I)
This paper discusses polyhedral approaches to problems in Domination Graph Thoery. We give various linear integer programming formulations for the weighted and unweighted versions of the minimum dominating set problem. We study the associated polytopes and determine dimension of the polytopes, facets, valid inequalities et al. Ideas from integer programming such as lift and project are used to ...
متن کاملPolyhedral Techniques in Combinatorial Optimization I: Theory
Combinatorial optimization problems appear in many disciplines ranging from management and logistics to mathematics, physics, and chemistry. These problems are usually relatively easy to formulate mathematically, but most of them are computationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades there has been a remarkable pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Geometry
سال: 2023
ISSN: ['1615-715X', '1615-7168']
DOI: https://doi.org/10.1515/advgeom-2023-0018